Rank Preserving Preferences
نویسندگان
چکیده
Hierarchies are stable institutions both within organizations and in society at large. While we know people work to maintain their own status in a hierarchy, and institutions exist to preserve the rank of those at the top, little has been done to measure the preference individuals have for preserving the hierarchical rank ordering of others. Using an original game we call the redistribution game, we show that people tolerate higher inequality in order to preserve preexisting rank orders of endowments. While a majority will accept redistributive transfers in order to reduce inequality, the proportion of subjects who reject the redistributive transfer increase by 31 percent if the transfer reverses the ordering. Controlling for factors like inequality aversion or loss aversion, we attribute the difference to rank preserving preferences (RPP). These results have implications for understanding why we tolerate inequality, and for explaining hierarchy and promotion structures within organizations.
منابع مشابه
Income redistribution going awry: The reversal power of the concern for relative deprivation
We demonstrate that a rank-preserving transfer from a richer individual to a poorer individual can exacerbate income inequality (when inequality is measured by the Gini coefficient). This happens when individuals’ preferences depend negatively not only on work time (effort) but also on low relative income. It is rigorously shown that the set of preference profiles that gives rise to this perver...
متن کاملar X iv : m at h / 06 01 25 4 v 2 [ m at h . O A ] 2 M ar 2 00 6 Rank Preserving Maps on CSL Algebras
We give a description of a weakly continuous rank preserving map on a reflexive algebra on complex Hilbert space with commutative completely distributive subspace lattice. We show that the implementation of a rank preserving map can be described by the combination of two different types of maps. We also show that a rank preserving map can be implemented by only one type if the corresponding lat...
متن کاملar X iv : m at h / 06 01 25 4 v 1 [ m at h . O A ] 1 1 Ja n 20 06 Rank Preserving Maps on CSL Algebras
We give a description of a rank preserving map on a reflexive algebra on complex Hilbert space with commutative completely distributive subspace lattice. We show that the implementation of a rank preserving map can be described by the combination of two different types of maps. We also show that a rank preserving map can be implemented by only one type if the corresponding lattice is irreducibl...
متن کاملRank-preserving Module Maps
In this paper, we characterize rank one preserving module maps on a Hilbert C∗−module and study its applications on free probability theory.
متن کاملEvaluating Rank Accuracy based on Incomplete Pairwise Preferences
Existing methods to measure the rank accuracy of a recommender system assume the ground truth is either a set of user ratings or a total ordered list of items given by the user with possible ties. However, in many applications we are only able to obtain implicit user feedback, which does not provide such comprehensive information, but only gives a set of pairwise preferences among items. Genera...
متن کامل